Binary Factor Analysis with Help of Formal Concepts
نویسندگان
چکیده
Binary factor analysis (BFA, also known as Boolean Factor Analysis) is a nonhierarchical analysis of binary data, based on reduction of binary space dimension. It allows us to find hidden relationships in binary data, which can be used for data compression, data mining, or intelligent data comparison for information retrieval. Unfortunately, we can’t effectively use classical (i.e. non-binary) factor analysis methods for binary data. In this article we show an approach based on utilizing formal concept analysis to compute nonhierarchical BFA. Computation of a concept lattice is a computationally expensive task too, still it helps us to speed up the BFA computation.
منابع مشابه
Using Blind Search and Formal Concepts for Binary Factor Analysis
Binary Factor Analysis (BFA, also known as Boolean Factor Analysis) may help with understanding collections of binary data. Since we can take collections of text documents as binary data too, the BFA can be used to analyse such collections. Unfortunately, exact solving of BFA is not easy. This article shows two BFA methods based on exact computing, boolean algebra and the theory of formal conce...
متن کاملOn Boolean factor analysis with formal concepts as factors
The paper presents results on factorization of binary matrices using formal concepts generated from the input matrix. We prove several results, e.g. that each matrix is conceptfactorizable, that concept-factorizability is the best way to factorize binary matrices, describe sets of good factors, mandatory factors, etc. In addition to that, we outline an algorithm for finding factors. The results...
متن کاملDiscovery of optimal factors in binary data via a novel method of matrix decomposition
a r t i c l e i n f o a b s t r a c t Keywords: Binary matrix decomposition Factor analysis Binary data Formal concept analysis Concept lattice We present a novel method of decomposition of an n × m binary matrix I into a Boolean product A • B of an n × k binary matrix A and a k × m binary matrix B with k as small as possible. Attempts to solve this problem are known from Boolean factor analysi...
متن کاملOptimal Factorization of Three-Way Binary Data Using Triadic Concepts
We present a new approach to factor analysis of three-way binary data, i.e. data described by a 3-dimensional binary matrix I, describing a relationship between objects, attributes, and conditions. The problem consists in finding a decomposition of I into three binary matrices, an object-factor matrix A, an attribute-factor matrix B, and a condition-factor matrix C, with the number of factors a...
متن کاملTriadic Factor Analysis
This article is an extension of work which suggests using formal concepts as optimal factors of Factor Analysis. They discussed a method for decomposing a p × q binary matrix W into the Boolean matrix product P ◦ Q of a p × n binary matrix P and a n × q binary matrix Q with n as small as possible. We have generalised this factorization problem to the triadic case, looking for a decomposition of...
متن کامل